Geometric Decay in a QBD Process with Countable Background States with Applications to a Join-the-Shortest-Queue Model

نویسندگان

  • Hui Li
  • Masakiyo Miyazawa
  • Yiqiang Q. Zhao
چکیده

A geometric tail decay of the stationary distribution has been recently studied for the GI/G/1 type Markov chain with both countable level and background states. This method is essentially the matrix analytic approach, and simplicity is an obvious advantage of this method. However, so far it can be only applied to the α-positive case (or the jittered case as referred to in the literature). In this paper, we specialize the GI/G/1 type to a quasi-birth-and-death (QBD) process. This not only refines some expressions because of the matrix geometric form for the stationary distribution, but also allows us to extend the study, in terms of the matrix analytic method, to non-α-positive cases. We apply the result to a generalized join-the-shortest-queue model, which only requires elementary computations. The obtained results enable us to discuss when the two queues are balanced in the generalized join-the-shortest-queue model, and establish the geometric tail asymptotics along the direction of the difference between the two queues.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Join the shortest queue among $$k$$ parallel queues: tail asymptotics of its stationary distribution

We are concerned with an M/M -type join the shortest queue (M/M -JSQ for short) with k parallel queues for an arbitrary positive integer k, where the servers may be heterogeneous. We are interested in the tail asymptotic of the stationary distribution of this queueing model, provided the system is stable. We prove that this asymptotic for the minimum queue length is exactly geometric, and its d...

متن کامل

A Joining Shortest Queue with MAP Inputs

In this paper we study a MAP/M/K system with join-the-shortest-queue (JSQ) discipline which consists of K servers and K queues with infinite buffers. An arrival joins the shortest queue and in the case that there are n (n≤ K) queues having the same shortest length, the customer will join any one of these shortest queues with probability 1/n. We model the system as a levelexpanding QBD (LDQBD) p...

متن کامل

A Study on State Dependent Accessible and Second Optional Service Queue with Impatient and Feedback Customers

In this paper, we study a single server Markovian queue with state dependent accessible services, reneging and feedback of customers. The server can accommodate at the most $d$ customers in the service station, after which the new arrivals have to wait in the primary queue of infinite waiting space. All arrivals demand First Essential Service (FES), after completing FES, customers decide to joi...

متن کامل

ASYMPTOTIC BEHAVIOR FOR MArP/PH/2 QUEUE WITH JOIN THE SHORTEST QUEUE DISCIPLINE

Abstract This paper considers a parallel queueing model with two servers, where arriving customers join the shortest queue. In [14], we studied a similar queueing model, and obtained the tail decay rate of the stationary distribution by using the matrix analytic approach. The main objectives of this paper are to extend the result in [14] to a more general model, and to clarify difficulty when w...

متن کامل

Geometric decay in level-expanding QBD models

Level-expanding quasi-birth-and-death (QBD) processes have been shown to be an efficient modeling tool for studying multi-dimensional systems, especially twodimensional ones. Computationally, it changes the more challenging problem of dealing with algorithms for two-dimensional systems to a less challenging one for block-structured transition matrices of QBD type with a varying finite block siz...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007